Topic%2DConstrained Hierarchical Clustering for Document Datasets.

Delivering Categorized News Items Using RSS Feeds and Web Services.

Stochastic model and evolutionary optimization algorithm for grid scheduling.

Dynamic Requests Scheduling Model in Multi%2Dcore Web Server.

Predicting Disk Failures with HMM%2D and HSMM%2DBased Approaches.

Parallel Mean Shift for Interactive Volume Segmentation.

Image processing based recognition of images with a limited number of pixels using simulated prosthetic vision.

Extracting Maximal Degenerate Motifs Based on a Suffix Tree.

Parallelization of Dissipative Particle Dynamics Simulation.

Parallel Branch and Bound Algorithms on Semi%2Dsupervised SVMs.

Second Life A New Window for E%2Dlearning.

An Enterprise Architecture Development Method in Chinese Manufacturing Industry.

Self%2Dcorrelating predictive information tracking for large%2Dscale production systems.

The Collaborative Learning Agent %28CLA%29 in Trident Warrior 08 Exercise.

Facilitating Decision Making
One resource playing a critical role in electronically supported decision-making groups is the facilitator. Facilitation is a complex task, encompassing social abilities, pre-meeting planning of decision-making processes and supervising the technology usage during meetings. We found two problems with previous support to electronic facilitation: (1) limited support to planning activities; and (2) limited support to remote facilitation. The Facilitation Tool was developed to address these two issues. The tool was built around a comprehensive decision-making model, contributing with design patterns to planning activities. The Facilitation Tool also provides a set of techniques to support remote meetings, allowing facilitators to steer and focus group participants, analyse and understand issues, and moderate conflicting or chaotic situations.  1 Introduction  The physical dispersion of current organisations, escalating complexity of problems and poor productivity of traditional meetings ha...
Document Clustering.
This paper presents the results of an experimental study of some common document clustering techniques: agglomerative hierarchical clustering and K-means. (We used both a “standard” K-means algorithm and a “bisecting ” K-means algorithm.) Our results indicate that the bisecting K-means technique is better than the standard K-means approach and (somewhat surprisingly) as good or better than the hierarchical approaches that we tested.
The Necessary and Sufficient Condition of a Class of Quasi%2DCyclic LDPC Codes without Girth Four.



Scalable Distributed Ontology Reasoning Using DHT%2DBased Partitioning.

Effective Pre%2Dretrieval Query Performance Prediction Using Similarity and Variability Evidence.

Web Page Categorization Based on k%2DNN and SVM Hybrid Pattern Recognition Algorithm.

RDF based Integrated Information Retrieval in grid computing environment.

A Stable Clock Synchronization Based on Clock Drift Rate.

Integrated scheduling of handling equipment at automated container terminals.

A Simultaneous Model of Consumer Brand Choice and Negotiated Price.

Searching With Style Authorship Attribution in Classic Literature.
analyzing texts in text mining, e.g., novels and plays that famous authors wrote, trying to measure the authors style, by choosing some attributes that shows the author style of writing, assuming that these writers have a special way of writing that no other writer has; thus, authorship attribution is the task of identifying the author of a given text. In this study, we propose an authorship attribution algorithm, improving the accuracy of Stylometric features of different professionals so it can be discriminated nearly as well as fingerprints of different persons using authorship attributes. Approach: The main target in this study is to build an algorithm supports a decision making systems enables users to predict and choose the right author for a specific anonymous author’s novel under consideration, by using a learning procedure to teach the system the Stylometric map of the author and behave as an expert opinion. The Stylometric Authorship Attribution (AA) usually depends on the frequent word as the best attribute that could be used, many studies strived for other beneficiary attributes, still the frequent word is ahead of other attributes that gives better results in the researches and experiments and still the best parameter and technique that’s been used till now is the counting of the bag-of-word with the maximum item set. Results: To improve the techniques of the AA, we need to use new pack of attributes with a new measurement tool, the first pack of attributes we are using in this study is the
Agent Based Mediation Architecture for Federated Digital Library Services.

Entropy%2DBased Authorship Search in Large Document Collections.

Authorship Attribution Via Combination of Evidence.

Developing the System of Web%2DData Mining from Chemical Database Based on Internet.

An Edge%2DFinding Algorithm on Blind Source Separation for Digital Wireless Applications.

Using Relative Entropy for Authorship Attribution.

Joint scheduling of material handling equipment in automated air cargo terminals.


On bent functions with some symmetric properties.


Transmission of correlated senders over a Rayleigh fading multiple access channel.

Effective and Scalable Authorship Attribution Using Function Words.
Abstract. Techniques for identifying the author of an unattributed document can be applied to problems in information analysis and in academic scholarship. A range of methods have been proposed in the research literature, using a variety of features and machine learning approaches, but the methods have been tested on very different data and the results cannot be compared. It is not even clear whether the differences in performance are due to feature selection or other variables. In this paper we examine the use of a large publicly available collection of newswire articles as a benchmark for comparing authorship attribution methods. To demonstrate the value of having a benchmark, we experimentally compare several recent feature-based techniques for authorship attribution, and test how well these methods perform as the volume of data is increased. We show that the benchmark is able to clearly distinguish between different approaches, and that the scalability of the best methods based on using function words features is acceptable, with only moderate decline as the difficulty of the problem is increased. 1
Large%2Dscale Drug Function Prediction by Integrating QIS D2 and BioSpice.

Drug Characteristics Prediction.

Clock Synchronization State Graphs Based on Clock Precision Difference.

Effective Document Clustering for Large Heterogeneous Law Firm Collections.

A design of orthogonal interleavers for multimodes turbo en%2Ddecoders.

Topic%2Ddriven Clustering for Document Datasets.

Hierarchical Clustering Algorithms for Document Datasets.
Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, hierarchical clustering solutions provide a view of the data at different levels of granularity, making them ideal for people to visualize and interactively explore large document collections.
Joint estimation and compression of correlated nonbinary sources using punctured turbo codes.

Near%2DShannon%2FSlepian%2DWolf performance for unknown correlated sources over AWGN channels.

Prediction of Contact Maps Using Support Vector Machines.
Contact map prediction is of great interest for its application in fold recognition and protein 3D structure determination. In this paper we present a contact-map prediction algorithm that employs Support Vector Machines as the machine learning tool and incorporates various features such as sequence profiles and their conservation, correlated mutation analysis based on various amino acid physicochemical properties, and secondary structure. In addition, we evaluated the effectiveness of the different features on contact map prediction for different fold classes. On average, our predictor achieved a prediction accuracy of 0.2238 with an improvement over a random predictor of a factor 11.7, which is better than reported studies. Our study showed that predicted secondary structure features play an important roles for the proteins containing beta structures. Models based on secondary structure features and CMA features produce different sets of predictions. Our study also suggests that models learned separately for different protein fold families may achieve better performance than a unified model.
Soft clustering criterion functions for partitional document clustering a summary of results.
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster similarity, are very effective in producing hard clustering solutions for document datasets and outperform traditional partitional and agglomerative algorithms. In this paper we study the extent to which these criterion functions can be modified to include soft membership functions and whether or not the resulting soft clustering algorithms can further improve the clustering solutions. Specifically, we focus on four of these hard criterion functions, derive their soft-clustering extensions, and present an experimental evaluation involving twelve different datasets. Our results show that introducing softness into the criterion functions tends to lead to better clustering results for most datasets.


Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering.

Self%2DAdaptive Clock Synchronization Based on Clock Precision Difference.
This paper presents an innovative strategy to synchronize all virtual clocks in asynchronous Internet environments. Our model is based on the architecture of one reference clock and many slave clocks communicating with each other over the Internet. The paper makes three major contributions to this research area. Firstly, one-way information transmission is applied to reduce traffic overhead on the Internet for the purpose of clock synchronization. Secondly, the slave nodes use local virtual time and the arrival timestamp, from the reference node, to create linear mathematical trend models and to retrieve the clock precision differences between reference clock and slave clocks. Finally, a fault-tolerant and selfadaptive model executed by each slave node based on the above linear trend model is created in order to ensure that the virtual clock is running normally, even when the link between the reference node and this slave node has crashed. We also present detailed simulations of this strategy and mathematical analysis on real Internet environments  .
Prediction of Contact Maps Using Support Vector Machines.
Contact map prediction is of great interest for its application in fold recognition and protein 3D structure determination. In this paper we present a contact-map prediction algorithm that employs Support Vector Machines as the machine learning tool and incorporates various features such as sequence profiles and their conservation, correlated mutation analysis based on various amino acid physicochemical properties, and secondary structure. In addition, we evaluated the effectiveness of the different features on contact map prediction for different fold classes. On average, our predictor achieved a prediction accuracy of 0.2238 with an improvement over a random predictor of a factor 11.7, which is better than reported studies. Our study showed that predicted secondary structure features play an important roles for the proteins containing beta structures. Models based on secondary structure features and CMA features produce different sets of predictions. Our study also suggests that models learned separately for different protein fold families may achieve better performance than a unified model.
Self%2DAdaptive Clock Synchronization for Computational Grid.

Evaluation of hierarchical clustering algorithms for document datasets.
Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, hierarchical clustering solutions provide a view of the data at different levels of granularity, making them ideal for people to visualize and interactively explore large document collections.
Data Compression of Correlated Non%2DBinary Sources Using Punctured Turbo Codes.

Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes.
The emergence of the world-wide-web has led to an increased interest in methods for searching for information. A key characteristic of many of the online document collections is that the documents have predefined category information, for example, the variety of scientific articles accessible via digital libraries (e.g., ACM, IEEE, etc.), medical articles, news-wires, and various directories (e.g., Yahoo, OpenDirectory Project, etc.). However, most previous information retrieval systems have not taken the pre-existing category information into account. In this paper, we proposed weight adjustment schemes based upon the category information in the vector-space model, which are able to select the most content specific and discriminating features. Our experimental results on TREC data sets show that the pre-existing category information does provide additional beneficial information to improve retrieval. The proposed weight adjustment schemes perform better than the vector-space model with the inverse document frequency (IDF) weighting scheme when queries are less specific. The proposed weighting schemes can also benefit retrieval when clusters are used as an approximation to categories.
Chaff Engineering an Efficient SAT Solver.
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search -- especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO.
Matching Architecture to Application Via Configurable Processors A Case Study with Boolean Satisfiability Problem.
Boolean Satisfiability (SAT) is a classical NP-complete problem with both theoretical and practical interests. This paper presents our work in developing an applicationspecific processor for SAT based on a commercial configurable processor core. We customize the processor configuration and design new instruction extensions based on the data structure and atomic operations used in SAT. The customized processor has achieved around 2-4X speedup at a very low hardware cost. The small size of the processor makes it possible to integrate multiple processors and other customized logic into a single chip for an application-specific multiprocessor solution for SAT. Our work shows the strength of application-specific processing in accelerating applications with complex control and dynamic data structures – an area that has traditionally not been targeted by application-specific processing. It also demonstrates that configurable processor cores can be used to cut the development time and cost for designing and building such applicationspecific processors. 1
Accelerating boolean satisfiability through application specific processing.
This paper presents our work in developing an application specific multiprocessor system for SAT, utilizing the most recent results such as the development of highly efficient sequential SAT algorithms, the emergence of commercial configurable processor cores and the rapid progress in IC manufacturing techniques. Based on an analysis of the basic SAT search algorithm, we propose a new parallel SAT algorithm that utilizes fine grain parallelism. This is then used to design a multiprocessor architecture in which each processing node consists of a processor and a communication assist node that deals with message processing. Each processor is an application specific processor built from a commercial configurable processor core. All the system configurations are determined based on the characteristics of SAT algorithms, and are supported by simulation results. While this hardware accelerator system does not change the inherent intractability of the SAT problems, it achieves a 30-60x speedup over and above the fastest known SAT solver -- Chaff. We believe that this system can be used to expand the practical applicability of SAT in all its application areas.
Exact memory size estimation for array computations.
Abstract — A novel storage requirement estimation methodology is presented for use in the early system design phases when the data transfer ordering is only partly fixed. At that stage, none of the existing estimation tools are adequate, as they either assume a fully specified execution order or ignore it completely. This paper presents an algorithm for automated estimation of strict upper and lower bounds on the individual data dependency sizes in high level application code given a partially fixed execution ordering. In the overall estimation technique, this is followed by a detection of the maximally combined size of simultaneously alive dependencies, resulting in the overall storage requirement of the application. Using representative application demonstrators, we show how our techniques can effectively guide the designer to achieve a transformed specification with low storage requirement.
Exact Memory Size Estimation for Array Computations without Loop Unrolling.

Small Weight Bases for Hamming Codes.

Small Weight Bases for Hamming Codes.

Is N%2DBest Dead%3F
We developed a faster search algorithm that avoids the use of the N-Best paradigm until after more powerful knowledge sources have been used. We found, however, that there was little or no decrease in word errors. We then showed that the use of the N-Best paradigm is still essential for the use of still more powerful knowledge sources, and for several other purposes that are outlined in the paper. 1.
Segmental Neural Net Optimization for Continuous Speech Recognition.

Hierarchical Mixtures of Experts Methodology Applied to Continuous Speech Recognition.

Segmental Neural Net Optimization for Continuous Speech Recognition.

A Hybrid Neural Net System for State%2Dof%2Dthe%2DArt Continuous Speech Recognition.

Some Approximation Properties of Projection Pursuit Learning Networks.

